On Cliques in Spanning Graphs of Projective Steiner Triple Systems
نویسنده
چکیده
We are interested in what sizes of cliques are to be found in any arbitrary spanning graph of a Steiner triple system S. In this paper we investigate spanning graphs of projective Steiner triple systems, proving, not surprisingly, that for any positive integer k and any sufficiently large projective Steiner triple system S, every spanning graph of S contains a clique of size k.
منابع مشابه
Colouring of cubic graphs by Steiner triple systems
Let S be a Steiner triple system and G a cubic graph. We say that G is S-colourable if its edges can be coloured so that at each vertex the incident colours form a triple of S. We show that if S is a projective system PG(n, 2), n ≥ 2, then G is S-colourable if and only if it is bridgeless, and that every bridgeless cubic graph has an S-colouring for every Steiner triple system of order greater ...
متن کاملEdge-colorings of cubic graphs with elements of point-transitive Steiner triple systems
A cubic graph G is S-edge-colorable for a Steiner triple system S if its edges can be colored with points of S in such a way that the points assigned to three edges Electronic Notes in Discrete Mathematics 29 (2007) 23–27 1571-0653/$ – see front matter © 2007 Elsevier B.V. All rights reserved. www.elsevier.com/locate/endm doi:10.1016/j.endm.2007.07.005 sharing a vertex form a triple in S. We sh...
متن کاملDecomposing block-intersection graphs of Steiner triple systems into triangles
The problem of decomposing the block intersection graph of a Steiner triple system into triangles is considered. In the case when the block intersection graph has even degree, this is completely solved, while when the block intersection graph has odd degree, removal of some spanning subgraph of odd degree is necessary before the rest can be decomposed into triangles. In this case, some decompos...
متن کاملHamilton Decompositions of Block-Intersection Graphs of Steiner Triple Systems
Block-intersection graphs of Steiner triple systems are considered. We prove that the block-intersection graphs of non-isomorphic Steiner triple systems are themselves non-isomorphic. We also prove that each Steiner triple system of order at most 15 has a Hamilton decomposable block-intersection graph.
متن کاملTriple factorization of non-abelian groups by two maximal subgroups
The triple factorization of a group $G$ has been studied recently showing that $G=ABA$ for some proper subgroups $A$ and $B$ of $G$, the definition of rank-two geometry and rank-two coset geometry which is closely related to the triple factorization was defined and calculated for abelian groups. In this paper we study two infinite classes of non-abelian finite groups $D_{2n}$ and $PSL(2,2^{n})$...
متن کامل